On bounded degree plane strong geometric spanners
نویسندگان
چکیده
Article history: Received 13 October 2010 Received in revised form 18 March 2012 Accepted 19 March 2012 Available online xxxx
منابع مشابه
On Spanners and Lightweight Spanners of Geometric Graphs
We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructin...
متن کاملBounded Degree Planar Geometric Spanners
Given a set P of n points in the plane, we show how to compute in O(n logn) time a subgraph of their Delaunay triangulation that has maximum degree 7 and is a strong planar t-spanner of P with t = (1 + √ 2) ∗ δ, where δ is the spanning ratio of the Delaunay triangulation. Furthermore, given a Delaunay triangulation, we show a distributed algorithm that computes the same bounded degree planar sp...
متن کاملOn Geometric Spanners of Euclidean Graphs and their Applications in Wireless Networks
We consider the problem of constructing a bounded-degree planar geometric spanner for a unit disk graph modeling a wireless network. The related problem of constructing a planar geometric spanner of a Euclidean graph has been extensively studied in the literature. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor ; however, its degree may not be bound...
متن کاملOn Geometric Spanners of Euclidean and Unit Disk Graphs
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor Cdel ≈ 2.42; however, its degree may not be bounded. Our first result is a very simple linear time algorithm for constructing a subgraph of the Delaunay graph with stretch factor ρ = 1 + ...
متن کاملDegree Four Plane Spanners: Simpler and Better
Let P be a set of n points embedded in the plane, and let C be the complete Euclidean graph whose point-set is P. Each edge in C between two points p, q is realized as the line segment [pq], and is assigned a weight equal to the Euclidean distance |pq|. In this paper, we show how to construct inO(n lgn) time a plane spanner of C of maximum degree at most 4 and of stretch factor at most 20. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Discrete Algorithms
دوره 15 شماره
صفحات -
تاریخ انتشار 2012